Tight Bounds for the Renewal Function of a Random Walk
نویسندگان
چکیده
منابع مشابه
Tight Bounds For Random MAX 2-SAT
For a conjunctive normal form formula F with n variables and m = cn 2-variable clauses (c is called the density), denote by maxF is the maximum number of clauses satisfiable by a single assignment of the variables. For the uniform random formula F with density c = 1 + ε, ε À n−1/3, we prove that maxF is in (1 + ε−Θ(ε3))n with high probability. This improves the known upper bound (1 + ε − Ω(ε3/ ...
متن کاملTight Bounds for the Cover Time of Multiple Random Walks
We study the cover time of multiple random walks. Given a graph G of n vertices, assume that k independent random walks start from the same vertex. The parameter of interest is the speed-up defined as the ratio between the cover time of one and the cover time of k random walks. Recently Alon et al. developed several bounds that are based on the quotient between the cover time and maximum hittin...
متن کاملA Random Walk with Exponential Travel Times
Consider the random walk among N places with N(N - 1)/2 transports. We attach an exponential random variable Xij to each transport between places Pi and Pj and take these random variables mutually independent. If transports are possible or impossible independently with probability p and 1-p, respectively, then we give a lower bound for the distribution function of the smallest path at point log...
متن کاملA Tight Lower Bound on Distributed Random Walk Computation
We consider the problem of performing a random walk in a distributed network. Given bandwidth constraints, the goal of the problem is to minimize the number of rounds required to obtain a random walk sample. Das Sarma et al. [PODC’10] show that a random walk of length l on a network of diameter D can be performed in Õ( √ lD + D) time. A major question left open is whether there exists a faster ...
متن کاملinvestigating the feasibility of a proposed model for geometric design of deployable arch structures
deployable scissor type structures are composed of the so-called scissor-like elements (sles), which are connected to each other at an intermediate point through a pivotal connection and allow them to be folded into a compact bundle for storage or transport. several sles are connected to each other in order to form units with regular polygonal plan views. the sides and radii of the polygons are...
ذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Annals of Probability
سال: 1980
ISSN: 0091-1798
DOI: 10.1214/aop/1176994732